OpenGL-assisted occlusion culling for large polygonal models

نویسندگان

  • Dirk Bartz
  • Michael Meißner
  • Tobias Hüttner
چکیده

We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of hierarchical model-space partitioning, OpenGL-assisted view-frustum culling, and OpenGL-assisted occlusion culling, we achieve a significantly better performance on general polygonal models than previous approaches. In contrast to these approaches, we only exploit common OpenGL features and therefore, our algorithm is also well suited for low-end OpenGL graphics hardware. Furthermore, we propose a small addition to the OpenGL rendering pipeline to enhance the framebuffer’s ability for faster and more detailed occlusion queries.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OpenGL-assisted Visibility Queries of Large Polygonal Models

We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of OpenGL-assisted frustum culling, hierarchical model-space partitioning, and OpenGL based occlusion culling, we achieve a significant better performance on general polygonal models than previous approaches. In contrast to these approaches, we only expl...

متن کامل

Efficient occlusion culling for large model visualization

Occlusion and visibility culling is one of the major techniques to reduce the geometric complexity of large polygonal models. Since the introduction of hardware assisted-occlusion culling in OpenGL (as an extension), solely software-based approaches are losing relevance rapidly for applications which cannot exploit specific knowledge of the scene geometry. However, there are still several issue...

متن کامل

Occlusion Culling in OpenSG PLUS

Very large polygonal models are frequently used in scientific computing, mechanical engineering, or virtual medicine. An effective technique to handle these large models is occlusion culling. Like most large model techniques, occlusion culling trades overhead costs with the rendering costs of the possibly occluded geometry. In this paper, we present occlusion culling techniques for OpenSG. Thes...

متن کامل

Generation of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models

Efficient handling of large polygonal scenes has always been a challenging task and in recent years, view-frustum and occlusion culling have drawn a lot of attention for accomplishing this goal. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present three adapted ...

متن کامل

Generation of Subdivision Hierarchies for Efficient Occlusion Culling of Large Polygonal Models

Efficient handling of large polygonal scenes has always been a challenging task. In recent years, view-frustum and occlusion culling have drawn a lot of attention for reducing the complexity of those scenes. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Graphics

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1999